Factorizations of Cunningham numbers with bases 13 to 99

نویسندگان

  • Richard P. Brent
  • Peter L. Montgomery
  • Herman J. J. te Riele
چکیده

This Report updates the tables of factorizations of an±1 for 13 ≤ a < 100, previously published asCWI Report NM-R9212 (June 1992) and updated in CWI Report NM-R9419 (Update 1, September1994) and CWI Report NM-R9609 (Update 2, March 1996). A total of 951 new entries in the tablesare given here. The factorizations are now complete for n < 76, and there are no composite cofactorssmaller than 10. This “Millennium edition” gives the complete tables incorporating all updates. A file containing onlythe new updates, a file containing factorizations for an extended table range, and a file of factors, areall available on the internet. 1991 Mathematics Subject Classification. Primary 11A25; Secondary 11-04

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorization and Palindromic Continued Fractions

Abstract We provide elementary explanations in terms of palindromic continued fraction expansions for the factorization of integers of the form a2 + 1, including Fermat numbers and Cunningham project numbers. This provides a generalization and more complete explanation of the factorization of the sixth Fermat number given by Freeman Dyson at the turn of the century. This explanation may provide...

متن کامل

Factorizations of the Fibonacci Infinite Word

The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from elementary properties of the Fibonacci numbers. 1 Preliminaries The well-known sequence of Fibonacci numbers (sequence A000045 in the On-Line Encyclopedia of Int...

متن کامل

#A16 INTEGERS 12A (2012): John Selfridge Memorial Issue THE SEARCH FOR AURIFEUILLIAN-LIKE FACTORIZATIONS

We searched the Cunningham tables for new algebraic factorizations similar to those discovered by Aurifeuille. A naive search would have been too slow. We accelerated it enough to make it feasible. Many interesting results were found. –Dedicated to the memory of John Selfridge, who loved the integers.

متن کامل

Factorization of the tenth Fermat number

We describe the complete factorization of the tenth Fermat number F10 by the elliptic curve method (ECM). F10 is a product of four prime factors with 8, 10, 40 and 252 decimal digits. The 40-digit factor was found after about 140 Mflop-years of computation. We also discuss the complete factorization of other Fermat numbers by ECM, and summarize the factorizations

متن کامل

A note on computing range space bases of rational matrices

We discuss computational procedures based on descriptor state-space realizations to compute proper range space bases of rational matrices. The main computation is the orthogonal reduction of the system matrix pencil to a special Kronecker-like form, which allows to extract a full column rank factor, whose columns form a proper rational basis of the range space. The computation of several types ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1004.3169  شماره 

صفحات  -

تاریخ انتشار 2010